Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(f(0,x),1) |
→ f(g(f(x,x)),x) |
| 2: |
|
f(g(x),y) |
→ g(f(x,y)) |
|
There are 3 dependency pairs:
|
| 3: |
|
F(f(0,x),1) |
→ F(g(f(x,x)),x) |
| 4: |
|
F(f(0,x),1) |
→ F(x,x) |
| 5: |
|
F(g(x),y) |
→ F(x,y) |
|
Consider the SCC {3-5}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 3, 2006